LBP and Irregular Graph Pyramids
نویسندگان
چکیده
In this paper, a new codification of Local Binary Patterns (LBP) is given using graph pyramids. The LBP code characterizes the topological category (local max, min, slope, saddle) of the gray level landscape around the center region. Given a 2D grayscale image I, our goal is to obtain a simplified image which can be seen as “minimal” representation in terms of topological characterization of I. For this, a method is developed based on merging regions and Minimum Contrast
منابع مشابه
Noise Robustness of Irregular LBP Pyramids
In this paper, we briefly introduce the SCIS algorithm a hierarchical image segmentation approach based on LBP pyramids and evaluate its robustness to uniform, Gaussian, and Poisson distributed additive chromatic noise. Moreover, we study the influence of image properties such as the amount of details and SNR on the segmentation performance. Our evaluation shows that SCIS is robust to Gaussian ...
متن کاملEquivalent Contraction Kernels and the Domain of Dual Irregular Pyramids 1
Dual graph contraction reduces the number of vertices and of edges of a pair of dual image graphs while, at the same time, the topological relations among the 'surviving' components are preserved. Repeated application produces a stack of successively smaller graphs: a pair of dual irregular pyramids. The process is controlled by selected decimation parameters which consist of a subset of surviv...
متن کاملPyramids of n-Dimensional Generalized Maps
Graph pyramids are often used for representing irregular pyramids. Combinatorial pyramids have been recently defined for this purpose. We define here pyramids of n-dimensional generalized maps. This is the main contribution of this work: a generic definition in any dimension which extend and generalize the previous works. Moreover, such pyramids explicitly represent more topological information...
متن کاملContains and inside relationships within combinatorial pyramids
Irregular pyramids are made of a stack of successively reduced graphs embedded in the plane. Such pyramids are used within the segmentation framework to encode a hierarchy of partitions. The different graph models used within the irregular pyramid framework encode different types of relationships between regions. This paper compares different graph models used within the irregular pyramid frame...
متن کاملHomology Group Generator Analysis in Irregular Graph Pyramids
Computation of homology generators using an irregular graph pyramid can significantly increase performance compared to the classical methods. First results in 2D exist and show the advantages of the method. The generators are computed in upper levels of pyramid where it is known that the graphs contains a number of self loops and multiple edges product of the contraction processes. Using a stra...
متن کامل